- minimax problem
- мат.минимаксная задача
English-Russian scientific dictionary. 2008.
minimax problem
Смотреть что такое "minimax problem" в других словарях:
Minimax estimator — In statistical decision theory, where we are faced with the problem of estimating a deterministic parameter (vector) from observations an estimator (estimation rule) is called minimax if its maximal risk is minimal among all estimators of . In a… … Wikipedia
Minimax — This article is about the decision theory concept. For other uses, see Minimax (disambiguation). Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a… … Wikipedia
Minimax-Prinzip — Die Minimax Regel ist eine Entscheidungsregel, um für den schlechtesten aller möglichen Fälle noch das beste aller möglichen Ergebnisse zu erzielen. (Das MINImum wird MAXimiert.) Inhaltsverzeichnis 1 Struktur des Minimax Prinzips 2 Entscheidungen … Deutsch Wikipedia
Minimax-Regel — Die Minimax Regel ist eine Entscheidungsregel, um für den schlechtesten aller möglichen Fälle noch das beste aller möglichen Ergebnisse zu erzielen. (Das MINImum wird MAXimiert.) Inhaltsverzeichnis 1 Struktur des Minimax Prinzips 2 Entscheidungen … Deutsch Wikipedia
minimax principle — noun : a principle of choice for a decision problem: one should choose the action which minimizes the loss that can be suffered even under the worst circumstances … Useful english dictionary
Monty Hall problem — In search of a new car, the player picks a door, say 1. The game host then opens one of the other doors, say 3, to reveal a goat and offers to let the player pick door 2 instead of door 1. The Monty Hall problem is a probability puzzle loosely… … Wikipedia
Smallest circle problem — The smallest circle problem or minimum covering circle problem is a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane. The corresponding problem in n dimensional space, the… … Wikipedia
Bargaining problem — The two person bargaining problem is a problem of understanding how two agents should cooperate when non cooperation leads to Pareto inefficient results. It is in essence an equilibrium selection problem; Many games have multiple equilibria with… … Wikipedia
Courant minimax principle — In mathematics, the Courant minimax principle gives the eigenvalues of a real symmetric matrix. It is named after Richard Courant. Introduction The Courant minimax principle gives a condition for finding the eigenvalues for a real symmetric… … Wikipedia
El Farol Bar problem — El Farol in Santa Fe The El Farol bar problem is a problem in game theory. Based on a bar in Santa Fe, New Mexico, it was created in 1994 by W. Brian Arthur. The problem is as follows: There is a particular … Wikipedia
1-center problem — The 1 center problem or minimax or minmax location problem is a classical combinatorial optimization problem in operations research of facilities location type. In its most general case the problem is stated as follows: given a set of n demand… … Wikipedia
